class Solution {
public:
    bool IsContinuous( vector<int> numbers ) 
    {
		if(numbers.empty())
			return false;
		//插入排序
		int j = 1;
		while(j < 5)
		{
			int val = numbers[j],i = j;
			for(; i > 0 && val < numbers[i-1]; --i)
				numbers[i] = numbers[i-1];
			numbers[i] = val;
			++j;
		}
		int zero = 0, val = 0;
		for(int i = 0 ; i < 4 ; ++i)
		//统计0的个数
			if(numbers[i] == 0)
				++zero;
		//统计间隔数
			else if(numbers[i+1] - numbers[i] == 0)
				return false;
			else
				val+=numbers[i+1] - numbers[i] -1;
		if(zero >= val)
			return true;
		return false;
	}
};